Inspection games with local and global allocation bounds

This article discusses a two‐player noncooperative nonzero‐sum inspection game. There are multiple sites that are subject to potential inspection by the first player (an inspector). The second player (potentially a violator) has to choose a vector of violation probabilities over the sites, so that the sum of these probabilities do not exceed one. An efficient method is introduced to compute all Nash equilibria parametrically in the amount of resource that is available to the inspector. Sensitivity analysis reveals nonmonotonicity of the equilibrium utility of the inspector, considered as a function of the amount of resource that is available to it; a phenomenon which is a variant of the well‐known Braess paradox. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Cost allocation of capacity investment games

Consider a manufacturer serving a set of retail stores each of which faces deterministic demands in a finite planning horizon. At the beginning of the planning horizon, the production capacity of the manufacturer is built, followed by production, outsourcing to third party manufacturers if necessary and distribution to the retail stores. Because the retail stores are usually managed by different managers who act as independent profit centers, it is desirable that the total cost is divided among the retail stores so that their incentives can be appropriately captured and thus efficient operations can be achieved. Under various conditions, we prove that there is a fair allocation of costs among the retail stores in the sense that no subset of retail stores subsidizes others, or equivalently, the resulting capacity investment game has a nonempty core, that is, the capacity investment game is a balanced game. In addition, our proof provides a mechanism to compute a fair cost allocation. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 512–523, 2013     

层次分析法的水下航行器维修性指标分配方法

基于层次分析法的水下航行器维修性指标分配方法把层次分析法应用到水下航行器维修性指标分配方法中,即邀请专家对故障的检测和隔离方式、可达性、可更换性和测试的困难等级进行两两比较,得到评价矩阵,据此,可以得到分配结果.这种方法克服了按故障率和设计特性分配法在设计特性相差不大时存在的缺陷,把定性分析与定量分析相结合.在设计初期即明确设计目标,除了考虑到单元的故障率还兼顾了初期设计过程中的不确定性.将这种方法应用于某水下航行器的维修性分配,结果表明,该方法具有实用价值.     

防空导弹反TBM作战指挥中目标分配关键问题研究

依据防空反导作战理论和目标分配的要求,对防空导弹反TBM作战指挥中目标分配的关键问题进行了研究。分别对威胁排序方法、拦截可行性条件、目标分配原则和目标分配算法进行了分析,提出了一种反TBM作战指挥中目标分配问题的算法,最后讨论了目标分配的评价问题。通过实际应用表明此方法是切实可行的。     

On the first come–first served rule in multi‐echelon inventory control

A two‐echelon distribution inventory system with a central warehouse and a number of retailers is considered. The retailers face stochastic demand and replenish from the warehouse, which, in turn, replenishes from an outside supplier. The system is reviewed continuously and demands that cannot be met directly are backordered. Standard holding and backorder costs are considered. In the literature on multi‐echelon inventory control it is standard to assume that backorders at the warehouse are served according to a first come–first served policy (FCFS). This allocation rule simplifies the analysis but is normally not optimal. It is shown that the FCFS rule can, in the worst case, lead to an asymptotically unbounded relative cost increase as the number of retailers approaches infinity. We also provide a new heuristic that will always give a reduction of the expected costs. A numerical study indicates that the average cost reduction when using the heuristic is about two percent. The suggested heuristic is also compared with two existing heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Budget allocation under uncertainty and the costs of war and insecurity

This study presents a framework and models for the analysis of government budget allocation into defense and civilian expenditures in situations of uncertainty about the incidence of war. The models display the intricate relationships between security levels, subjective probabilities of the occurrence of war, and potential war damages. We show that poor countries tend to perceive greater probabilities of war than their richer rivals, and that the psychological burden of insecurity is larger when the country’s wealth is larger and when its preference for security is higher. We apply our models to the Israeli–Syrian arms race and show that the higher rate of growth of Israel’s gross domestic product relative to that of Syria is expected to lead to an increase in Syria’s perception of the likelihood of war and to a decrease in Israel’s perception of such a likelihood. We also show that if Syria’s regime becomes ideologically more extreme, the monetary cost of maintaining Israel’s security at the level that it enjoyed prior to the change will be very high, whereas the monetary cost of maintaining Israel’s welfare will be moderate.     

战时弹药供应协同调运模型研究

弹药协同调运是战时弹药保障工作中的重要环节,其协同调运的合理性将直接影响到弹药保障工作的顺利进行.针对弹药的调运问题,从战时技术实施与应用角度研究弹药的调运问题,以到达需求点的运输时间、弹药输送车数量以及弹药损失量为优化目标,建立一种多目标决策模型,为缩短运输时间、减少弹药输送车数量、提高安全到达需求点的弹药量提供一种实用的方法.     

结合非负张量表示与扩展隐Dirichlet分配模型的图像标注

由于"语义鸿沟"的存在,自动图像标注是一项极具挑战性的工作。考虑到图像低层视觉特征与高层语义概念的差异,分别从图像表示与语义建模两个方面来实现自动图像标注。在图像表示方面,提出了一种正则化约束下的非负张量表示方法,用以提取符合人眼视觉直观理解的图像高阶结构特征。在语义建模方面,提出了一种三层贝叶斯模型——扩展隐Dirichlet分配。该模型利用隐变量来实现图像与标注词的关联,并通过一种基于变分推理的期望最大值方法来估计参数。实验结果表明,ELDA模型在大规模数据库NUS-WIDE上的标注结果相较于现有方法有了显著的提高。     

基于混沌pso算法的实时动态目标分配

任务分配是多导弹协同攻击目标的重要前提,在充分考虑满足复杂战场环境各种约束的条件下,提出了基于混沌粒子群算法的实时动态算法,使得算法在求解WTA问题时具有处理意外目标和任意时刻响应当前战场状态的实时动态特性。并为了解决战场环境中各不确定性因子对新加入目标优先级的影响,提出基于三元区间数表示关联熵的复合物元目标排序方法。     

基于故障率和设计特性动态加权的维修性分配法

针对国军标中"按故障率和设计特性的维修性分配方法",当可更换单元故障率相差较大时,分配结果与实际明显不符的问题,采用动态加权模型,对国军标的分配方法进行了改进,提出了"基于故障率和设计特性动态加权的维修性分配法",弥补了国军标分配方法的不足。通过理论分析、论证、算例比较和维修性试验验证,证明该方法合理可行。